Order Divisor Graphs of Finite Groups Un and K4
Pankaj
Department of Mathematics, Indira Gandhi University, Meerpur (Rewari)-122502, Haryana, India
*Corresponding Author E-mail: pankajarora1242@yahoo.com
Abstract:
We represent finite group in the form of graphs. These graphs are called order divisor graphs. In this paper, we shall study order divisor graphs of finite groups Un (multiplicative group of integers modulo n) and K4 (Klein’s four group).
KEY WORDS: Finite Group, Order Divisor Graph.
2010 MATHEMATICS SUBJECT CLASSIFICATIONS: 05C25, 68R10, 97K30, 20B05
1. INTRODUCTION
The phenomenon of representing groups using graphs has been studied theoretically by a number of researchers [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11]. The interplay between groups and graphs have been the most famous and productive area of algebraic graph theory. In this paper, we give order divisor graphs of finite groups Un (multiplicative group of integers modulo n) and K4 (Klein’s four group).
2. ORDER DIVISOR GRAPH OF GROUP
2.1. Definition: We call a graph an order divisor graph, denoted by OD(G), if its vertex set is a finite group G and two distinct vertices a and b having different orders are adjacent, provided that o(a) divides o(b) or o(b) divides o(a).
2.2. Order Divisor Graph of Un
The multiplicative
group of integers modulo n is given by
. The order
divisor graphs of Un for
some n are given as follows:
2.2.1. Order Divisor Graph of U2
The multiplicative group of integers modulo 2 is U2 ={1}. The order divisor graph of U2 shown below is a finite, complete and connected graph. Also the chromatic number is 1.
Fig. 1: OD (U2)
2.2.2. Order Divisor Graph of U3
The multiplicative group of integers modulo 3 is U3 ={1,2}. The order divisor graph of U3 shown below is a finite, complete, connected, bipartite, regular and planar graph. Also the chromatic number is 2.
Fig. 2: OD (U3)
2.2.3. Order Divisor Graph of U5
The multiplicative group of integers modulo 5 is U5= {1,2,3,4}. The order divisor graph of U5 shown below is a finite and connected graph. Also the chromatic number is 3.
Fig. 3: OD (U5)
2.2.4. Order Divisor Graph of U9
The multiplicative group of integers modulo 9 is U9= {1,2,4,5,7,8} . The order divisor graph of U9 shown below is a finite and connected graph. Also the chromatic number is 3.
Fig. 4: OD (U9)
2.2.5. Order Divisor Graph of U13
The multiplicative group of integers modulo 13 is U13= {1,2,3,4,5,6,7,8,9,10,11,12}. The order divisor graph of U13 shown below is a finite and connected graph. Also the chromatic number is 4.
Fig. 5: OD (U13)
2.2.6. Order Divisor Graph of U16
The multiplicative group of integers modulo 16 is U16= {1,3,5,7,9,11,13,15}. The order divisor graph of U16 shown below is a finite and connected graph. Also the chromatic number is 3.
Fig. 6: OD (U16)
2.2.7. Order Divisor Graph of U17
The multiplicative group of integers modulo 17 is U17= {1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16}. The order divisor graph of U17 shown below is a finite and connected graph.
Fig. 7: OD (U17)
2.3. Order Divisor Graph of K4
The Klein’s four group K4 is given by K4={e,a,b,c}, where a2= b2=c2=e and ab=ba=c, bc=cb= a and ca=ac=b The order divisor graph of K4 shown below is a finite, connected and planar graph. Also the chromatic number is 2.
Fig. 8: OD (K4 )
REFERENCES:
[1] S. Akbari, and A. Mohammadian, On zero divisor graphs of finite rings, J. Algebra, 314 (2007), 168-184.
[2] D.F. Anderson, and P.S. Livingston, The zero divisor graph of a commutative ring, J. Algebra, 217 (1999), 434-447.
[3] F.R. DeMeyer, and L. DeMeyer, Zero divisor graphs of Semigroup, J. Algebra, 283 (2005), 190 – 198.
[4] A. D. Godase, Unit Graph of Some Finite Group Zn, Cn and Dn, International Journal of Universal Science and Technology, 1(2) (2015), 122-130.
[5] A. D. Godase, Unit Subgraph of Some Finite Group Zn, Cn and Dn, Research Gate pub. (2015), DOI: 10.13140/RG.2.1.3415.6648.
[6]
Pankaj,
Order
Prime Graphs of Finite Groups
and
,
Research Journal of Science and Technology, 9(2) (2017), 285-287.
[7] Pankaj, Unit Graphs and Subgraphs of direct product of Dihedral and Symmetric Groups, Aryabhatta Journal of Mathematics & Informatics, 9(1) (2017), 59-70.
[8] Pankaj and Ajay Kumar, Power Graphs of Symmetric, Quaternion and Heisenberg Groups, Aryabhatta Journal of Mathematics & Informatics, 9(2) (2017), 297-300.
[9]
Pankaj
and Dev Deep, Unit Graphs and Subgraphs of Finite Groups
and
, International
Journal of Engineering and Science Invention, 6(7) (2017), 64-71.
[10] Pankaj, Gunjan and M. Pruthi, Unit Graphs and Subgraphs of Symmetric, Quaternion and Heisenberg Groups, Journal of Information & Optimization Sciences, 38 (1) (2017), 207–218.
[11] S. U. Rehman, A. Q. Baig, M. Imran and Z. U. Khan, Order divisor graphs of finite groups, arXiv: 1611.04280v2, (2016).
[12] T.M. Apostol, Introduction to Analytic number theory, Narosa publishing house, 1998.
[13] I. Beck, Colouring of a commutative ring, J. Algebra, 116 (1988), 208-226.
[14] G. Birkhoff and T.C. Bartee, Modern Applied Algebra, Mc- Graw Hill, New York, 1970.
[15] B. Bollobas, Modern Graph Theory, Springer-Verlag, New York, 1998.
[16] Dipak Chatterjee, Abstract Algebra, Prentice Hall of india private limited, 2001.
[17] F. Harary, Graph Theory, Addison Wesley, 1972.
[18] I.N. Herrnstein, Topics in Algebra, Wiley Eastern Limited, 1975.
[19] K.R. Parthasarathy, Basic Graph Theory, Tata McGraw-Hill publishing Company Limited, 1994.
|
Received on 03.10.2017 Modified on 28.12.2017 Accepted on 05.01.2018 ©A&V Publications All right reserved Research J. Science and Tech. 2018; 10(1): 09-12 DOI: 10.5958/2349-2988.2018.00002.5 |
|